Some Remarks on Completeness , Connection Graph Resolutionand
نویسندگان
چکیده
A new completeness proof that generalizes the Anderson-Bledsoe excess literal argument is developed for connection-graph resolution. This technique also provides a simpliied completeness proof for semantic resolution. Some observations about subsumption and about link deletion are also made. Link deletion is the basis for connection graphs. Subsumption plays an important role in most resolution-based inference systems. In some settings|for example, connection graphs for negation normal form|both subsumption and link deletion can be quite tricky. Nevertheless, a completeness result is obtained in this setting that employs subsumption and link deletion.
منابع مشابه
Remarks on completeness of lattice-valued Cauchy spaces
We study different completeness definitions for two categories of lattice-valued Cauchy spaces and the relations between these definitions. We also show the equivalence of a so-called completion axiom and the existence of a completion.
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملSome remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs
Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملSome Remarks On Global Total Domination In Graphs∗
A subset S of vertices in a graph G is a global total dominating set, or just GTDS, if S is a total dominating set of both G and G. The global total domination number γgt(G) of G is the minimum cardinality of a GTDS of G. In this paper, we show that the decision problem for γgt(G) is NP-complete, and then characterize graphs G of order n with γgt(G) = n− 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007